Bandwidth management for MPLS fast rerouting

ABSTRACT

Certain exemplary embodiments provide a method comprising: in a network at a node located on a label switched path: selecting a backup path to respond to a failure; and for each link along the backup path, reserving a backup bandwidth, wherein the backup bandwidth is sufficient to reroute traffic around the failure.

CROSS-REFERENCE TO RELATED APPLICATION

The present application is a continuation of U.S. patent applicationSer. No. 13/490,960, filed on Jun. 7, 2012, which is a continuation ofU.S. patent application Ser. No. 12/141,267, filed on Jun. 18, 2008, nowU.S. Pat. No. 8,208,371, which is a continuation of U.S. patentapplication Ser. No. 11/030,386 filed on Jan. 6, 2005, now U.S. Pat. No.7,406,032, all of which are hereby incorporated by reference in theirentireties.

BACKGROUND

A wide variety of potential embodiments will be more readily understoodby those skilled in the art. Digital communications have becomepervasive with the advent of computer networks, including the mostfamiliar network, the Internet. Computer networks such as the Internetcan be categorized as mesh networks wherein at least some nodes connectvia links to a plurality of other nodes. For digital data, bandwidth istypically measured in bits per unit of time, such as bits per second(bps). Service providers can use Internet Protocol/Multiple ProtocolLabel Switching (IP/MPLS) on networks for applications that can utilizea large amount of bandwidth such as voice over IP, streaming video,streaming audio, video teleconferencing, and/or on-line games, etc. MPLScommunication involves determining a label switched path (LSP) overwhich traffic is initially routed.

Labels can be placed on each packet such that data can be transferredwithout recalculating a new label switched path at each node on thelabel switched path (or service path) as packets are passed from asource node to a destination node of the label switched path. Once thelabel switched path is determined from the source node to thedestination node, absent a failure in the network, packets can belabeled and passed along the label switched path without changes to theheaders or packet routing.

Dealing with network failures can be an important consideration tosatisfying customers of service providers using MPLS as a signalingstandard for traffic. Network users desire communications that appear tobe uninterrupted and clear. Thus, systems that provide low hardwareoverhead, fault tolerance, and path recovery that take place quicklyenough to not be noticeable by users can be desirable for MPLS systems.

BRIEF DESCRIPTION OF THE DRAWINGS

A wide variety of potential embodiments will be more readily understoodthrough the following detailed description, with reference to theaccompanying drawings in which:

FIG. 1 is a block diagram of an exemplary embodiment of a network withfast reroute restoration 1000;

FIG. 2 is a block diagram of an exemplary embodiment of a network withbackup bandwidth sharing 2000;

FIG. 3 is a block diagram of an exemplary embodiment of a network withfast reroute creation procedure 3000;

FIG. 4 is a block diagram of an exemplary embodiment of a network withoptimized backup path selection 4000;

FIG. 5 is a performance graph 5000 relating to an operative embodiment;

FIG. 6 is a performance graph 6000 relating to an operative embodiment;

FIG. 7 is a performance graph 7000 relating to an operative embodiment;

FIG. 8 is a flow diagram of an exemplary embodiment of a method 8000 forprovisioning backup label switched paths in a network for reroutingtraffic around a failure should the failure occur;

FIG. 9 is a flow diagram of an exemplary embodiment of a method 9000 forupdating a network for deletion of a label switched path, wherein thenetwork is adapted to reroute traffic around a failure should thefailure occur;

FIG. 10 is a flow diagram of an exemplary embodiment of a method 10000for responding to a network failure; and

FIG. 11 is a block diagram of an exemplary embodiment of an informationdevice 11000.

DETAILED DESCRIPTION

As used herein, the term “network” means a communicatively coupledplurality of communication devices. Examples include wired and/orwireless communications networks, such as public, private,circuit-switched, packet-switched, connection-less, virtual, radio,telephone, POTS, non-POTS, PSTN, non-PSTN, cellular, cable, DSL,satellite, microwave, twisted pair, IEEE 802.03, Ethernet, token ring,local area, wide area, IP, Internet, intranet, wireless, Ultra Wide Band(UWB), Wi-Fi, BlueTooth, Airport, IEEE 802.11, IEEE 802.111, IEEE802.11b, IEEE 802.11g, X-10, and/or electrical power networks, etc.,and/or any equivalents thereof.

Digital communications have become pervasive with the advent of computernetworks, including the most familiar network, the Internet. As usedherein, the term “node” means in networks, a processing location. A nodecan be an information device, router, switch, gateway, hub, and/ormultiplexer, etc. As used herein, the term “link” means a communicativeconnection (physical and/or logical) between two network nodes. Computernetworks such as the Internet can be categorized as mesh networkswherein at least some nodes connect via links to a plurality of othernodes. As used herein, the term “bandwidth” means an amount oftransmitted data that a link can convey in a fixed amount of time. Fordigital data, bandwidth is typically measured in bits per unit of time,such as bits per second (bps).

As used herein, the term “IP” (Internet Protocol) means a networkprotocol that specifies the format of packets, also called datagrams,and the addressing scheme for the packets. As used herein, the term“message” means a communication. By itself, IP is a protocol forproviding a message from one communicator to another. As used herein,the term “IP network” means a network that uses an IP protocol for datacommunications. As used herein, the term “Multiple Protocol LabelSwitching (MPLS)” means a standard for network communications. In anetwork using MPLS, as an IP data stream enters the edge of the network,the ingress node reads a full address of data packet and attaches asmall “label” in the packet header, which precedes the packet. Once the“label” is added, the data stream can be routed relatively quickly to adestination node along a specific label switched path (LSP).

Service providers can use Internet Protocol/Multiple Protocol LabelSwitching (IP/MPLS) on networks for applications that can utilize alarge amount of bandwidth such as voice over IP, streaming video,streaming audio, video teleconferencing, and/or on-line games, etc. Asused herein, the term “path” means a communicatively coupled collectionof devices and links in a network. As used herein, the term “labelswitched path (LSP)” means a specific path through a network that datafollows through a mesh network.

Data packets communicated using a label switched path comprise MPLSlabels that comprise label switched path information. As used herein,the term “traffic” means data being transmitted via a network. MPLScommunication involves determining a label switched path (LSP) overwhich traffic is initially routed. As used herein, the term “service”means an activity provided for the benefit of another. For example, a“service path” is a path adapted to provide transmission of data over aselected label switched path for the benefit of a user transmittingand/or receiving the data. Labels can be placed on each packet such thatdata can be transferred without recalculating a new label switched pathat each node on the label switched path (or service path) as packets arepassed from a source node to a destination node of the label switchedpath. As used herein, the term “determined” means ascertained, obtained,and/or calculated. As used herein, the term “failure” means a cessationof proper functioning or performance

Once the label switched path is determined from the source node to thedestination node, absent a failure in the network, packets can belabeled and passed along the label switched path without packetrerouting. As used herein, the term “signal” means detectabletransmitted energy that can be used to carry information. Dealing withnetwork failures can be an important consideration to satisfyingcustomers of service providers using MPLS as a signaling standard fortraffic. Network users desire communications that appears to beuninterrupted and clear. Thus, systems that provide fault tolerance andpath recovery that take place quickly enough to not be noticeable byusers can be desirable for MPLS systems.

Thus, rapid restoration of communications responsive to a failure can bea consideration in operative embodiments of IP/MPLS communicationssystems. As used herein, the term “backup” means reserve, or standby. Asused herein, the term “backup path” means a reserve or standby data pathin a mesh network adapted for use in event of a failure in a labelswitched path.

As used herein, the term “fast reroute” means a scheme of restoration inMPLS network. MPLS fast reroute can, in certain embodiments, reroutetraffic onto predetermined backup paths within 10 s of millisecondsafter detecting a failure. Systems switching MPLS traffic that quicklycan provide service to users wherein failures appear to be relativelyunnoticeable. As used herein, the term “predetermined” means establishedin advance. Predetermined signaling extensions can be used in support ofMPLS fast rerouting backup path creation. A path merging technique canbe used to share the bandwidth on common links among a label switchedpath and backup label switched paths created to reroute traffic aroundpredetermined failures on the label switched path. As used herein, theterm “reroute” means to switch to a backup path. MPLS fast rerouteachieves rapid restoration by computing and signaling backup labelswitched path (LSP) in advance and re-directing traffic as close tofailure point as possible.

As used herein, the term “restoration bandwidth” means an amount ofcommunication capacity on a link to reroute network traffic around afailure. In certain exemplary IP/MPLS networks, restoration bandwidthcan be managed in a distributed fashion. Optimized restoration paths canbe selected on each node of the label switched path independently. Incertain exemplary embodiments, bandwidth for backup paths can be sharedamong any label switched paths and backup label switched paths that arefailure disjoint for MPLS fast reroute. As used herein, the term“reserved” means to set aside for a future purpose. Pre-establishedbackup label switched paths need not consume bandwidth until a failurehappens, yet enough restoration bandwidth can be reserved to guaranteethat all affected label switched paths can be restored in the event ofany single predetermined failure. As used herein, the term “necessary”means needed to satisfy.

Without bandwidth sharing among backup label switched paths fordifferent label switched paths, the network might need to reserve muchmore bandwidth on its links than would be necessary for label switchedpath traffic. Certain exemplary embodiments comprise a distributedbandwidth management approach for MPLS fast reroute for bandwidthsharing among any label switched paths and backup label switched paths.Certain exemplary embodiments can be based on the observation that therestoration bandwidth can be shared by multiple backup label switchedpaths so long as label switched path segments are not susceptible tosimultaneous failure. As used herein, the term “selection” means adaptedto choose an item. A backup path selection algorithm can act to maximizethe bandwidth sharing. Certain exemplary embodiments do not conflictwith IETF standards for MPLS fast rerouting.

Distributed bandwidth management and backup path selection can bedetermined responsive to link usage information that is distributedthroughout the network. As used herein, the term “information” meansdata that has been organized to express concepts. Some bandwidth relatedinformation can be provided to network nodes by current link staterouting protocol extensions. Signaling protocol extensions can be usedto distribute certain information among network nodes. In certainexemplary embodiments, the overhead of distributing the additional linkinformation can be scalable. Certain exemplary embodiments compriselabel switched path restoration in the event of a single failure. Thesingle failure constraint can be reasonable since a backup labelswitched path is likely to be used only for a short time until thefailure is repaired or a new label switched path is established. As usedherein, the term “flooding” means broadcasting a message to a pluralityof network nodes. Certain exemplary embodiments can communicateinformation used for bandwidth management without extra link stateinformation flooding the network via a routing protocol. Instead,information gathering can be distributed via signaling extensions.

Bandwidth efficiencies can be evaluated by simulating a typical USintercity backbone network. Simulations can be based on an exemplarynetwork topology and a traffic pattern typically experienced inintercity communications. As used herein, the term “reduce” meansdecrease in magnitude. Simulation results demonstrate that sharedbandwidth management can reduce the amount of reserved restorationbandwidth to an overbuild level of approximately 60% in an exemplaryapplication. Reducing the amount of reserved restoration bandwidth canresult in relatively low system costs. Certain exemplary bandwidthmanagement schemes can be suitable for use in real IP/MPLS networks.

As used herein, the term “delete” means remove and/or erase from amemory.

As used herein, the term “memory” means a device capable of storinganalog or digital information. The memory can be coupled to a processorand can store instructions adapted to be executed by processor accordingto an embodiment disclosed herein. Certain exemplary embodiments canestablish and/or delete backup paths as label switched paths come and goin a distributed MPLS network. Network capacity can be managed in adistributed way such that label switched paths can share bandwidth oncommon links with backup paths created to reroute traffic aroundfailures associated with the label switched path. In certain exemplaryembodiments backup paths can share bandwidth with other failure disjointbackup paths for other label switched paths.

As used herein, the term “value” means an assigned or calculatednumerical quantity. In certain exemplary embodiments, the network cancomprise any number of nodes. For example, nodes in the network cannumber such as from approximately 5 to approximately 10 million or morenodes, including all values therebetween (e.g., 7, 23, 976, 1109,34,569, and/or 567,999, etc.) and all subranges therebetween. To reroutenetwork traffic around any single network failure on a label switchedpath that traverses N nodes, there can be as many as N−1 backup paths.

In certain exemplary embodiments, a backup label switched path bandwidthcan be shared between the backup path and the label switched path. Whena backup path intersects the label switched path at a node with the sameoutgoing interface (e.g., port, logical channel, etc.), the bandwidth ofthe backup path can be merged with the bandwidth of its label switchedpath for bandwidth reservation purposes. When two backup paths that havebeen created to reroute traffic for the same label switched path travela common link in the same direction, the reserved bandwidths of the twobackup paths can be shared since they are rerouting traffic arounddifferent failure scenarios, and thus, the bandwidth of one of the twobackup paths can be ignored, such that the reserved bandwidth is lessthan the combined reserved bandwidths of the two backup paths and/or isequal to the larger of the two reserved bandwidths. When a failureoccurs along the label switched path, the upstream node close to thefailure point can detect the failure and can re-direct traffic aroundthe failure point onto a backup path.

FIG. 1 is a block diagram of an exemplary embodiment of a network 1000.The network comprises nine nodes for illustrative purposes. An exemplaryembodiment of a label switched path on network 1000 can comprise fivenodes and can have four backup paths.

In FIG. 1 an LSP can be defined as:

1100 to 1200 to 1300 to 1400 to 1500.

A plurality of backup paths can be defined as:

Failure Point Path 1150 or 1200 1100 to 1600 to 1700 to 1800 to 1400 to1500 1250 or 1300 1100 to 1200 to 1700 to 1800 to 1400 to 1500 1350 or1400 1100 to 1200 to 1300 to 1800 to 1900 to 1500 1450 1100 to 1200 to1300 to 1400 to 1900 to 1500

Thus, if node 1300 fails, node 1200 can detect the failure and canredirect traffic along a backup path originating at node 1200. Networktraffic can travel along a path from 1100 to 1200 to 1700 to 1800 to1400 to 1500. Since node 1200 might not distinguish a failure of link1250 from a failure of node 1300, the backup path originating at node1200 can exclude node 1300. Although backup label switched paths neednot actually use bandwidth before failure, enough bandwidth can bereserved at each node along backup label switched path links to allowfor rerouting traffic responsive to the failure.

In certain exemplary embodiments, a MPLS network can be represented by agraph comprising a plurality of network nodes and a plurality of networklinks As used herein, the term “request” means a message asking forsomething. Requests for backup bandwidth to reroute traffic in the eventof a failure on the label switched path can originate at clients andarrive at the source nodes and can be established or deleted in adistributed manner, via signaling among nodes. As used herein, the term“downstream” means in a direction away from a node on a unidirectionallink. As used herein, the term “immediately downstream” means separatedin a mesh network by no more than one link. For example, a link isimmediately downstream of a first node when the link is directlycommunicatively coupled to the first node and on a unidirectional pathexiting from the first node. A second node is immediately downstream ofthe first node if it is downstream of the first node and communicativelycoupled to the first node by a single link. A failure immediatelydownstream of a first node can comprise a failure of the link and/or thesecond node.

For each label switched path request, a source node can compute a labelswitched path and each node except the destination node along the labelswitched path can compute a backup path adapted to reroute data trafficaround a failure immediately downstream of each respective node on thelabel switched path. As used herein, the term “unidirectional” means ina single direction only. The backup path can comprise bandwidthallocated to reroute traffic around a failure of a predetermined node ora predetermined link immediately downstream of each respective node.

In general, multiple label switched paths can share common networkresources, hence a single network resource failure, such as link failureor node failure, can cause multiple label switched paths to failsimultaneously. Design objectives for a label switched path and aplurality of backup paths associated with the label switched path canbe:

each backup path can be disjoint of the immediately downstream link orthe immediately downstream node of the particular node;

bandwidths associated with different backup paths adapted to reroutetraffic from the label switched path can be shared if they share acommon link;

backup label switched paths from different label switched paths canshare bandwidth on common links if their respective label switched pathfailure points are not subject to simultaneous failure;

enough bandwidth can be reserved on all links in the network such thatfor any single failure, there is enough bandwidth to restore allaffected label switched paths; and

the total bandwidth reserved for restoration over the whole network canbe minimized in order to minimize network costs.

As used herein, the term “optimized backup path” means a continuousseries of connected devices in a network not comprising a predetermineddevice around which network traffic will be rerouted in event that thepredetermined device fails, the continuous series of connected devicesselected as using and/or requiring fewer network resources as comparedto alternate paths. In certain exemplary embodiments, network nodes canmanage resources in a distributed manner to reroute network traffic inevent of a network failure, reserve restoration capacity on links, andcompute optimized backup paths. Since label switched path requests canarrive one at a time at a source node, the source node and the nodesalong the label switched path can make routing decisions withoutknowledge of future requests.

FIG. 2 is a block diagram of an exemplary embodiment of a network 2000,which comprises six nodes and seven links.

A first LSP can be defined as:

2100 to 2200.

A backup path can be defined as:

Failure Point Path 2150 2100 to 2300 to 2400 to 2200

Suppose a request for a first label switched path arrives at node 2100and asks for one unit of bandwidth on link 2150. In preparing for afailure of link 2150, node 2100 can select a path 2100 to 2200 for alabel switched path and 2100 to 2300 to 2400 to 2200 for a backup path.When the first label switched path is established, one unit of bandwidthcan be allocated on link 2150, and one unit of bandwidth can be reservedon each of links 2175, 2350, and 2450. Subsequently, a second labelswitched path can be requested as:

2500 to 2600.

In creating the label switch path, one unit bandwidth can be allocatedon link 2550. A backup path can be defined as:

Failure Point Path 2550 2500 to 2300 to 2400 to 2600

Node 2500 can select the path 2500 to 2600 for service path of thesecond label switched path and 2500 to 2300 to 2400 to 2600 as a backuppath of the second label switched path. In this exemplary embodiment,when setting up the second label switched path, it is unnecessary toreserve an additional unit of bandwidth on link between node 2300 andnode 2400 because the two label switched paths, 2100 to 2200 and 2500 to2600, are failure disjoint, i.e., they are assumed not to be subject tosimultaneous failure. Thus, a total of five units of bandwidth can bereserved to reroute traffic associated with both label switched paths inevent of any single link failure whereas without shared reservations, atotal of six units of bandwidth would be needed. Sharing reservedbandwidths among backup paths of different label switched paths canreduce total reserved bandwidths.

In MPLS networks, a link state routing protocol, such as Open ShortestPath First protocol (OSPF) or Intermediate System-Intermediate Systemprotocol (IS-IS), can be used to distribute network topology informationto each node in a particular network routing domain. Traditionally,these protocols have propagated link up/down status information amongthe nodes. To support path computation in MPLS networks, both OSPF andIS-IS can be extended to propagate additional information about eachlink, such as available bandwidth, bandwidth in service, and/orbandwidth reserved, etc. The additional information can be used toselect a label switched path for each label switched path request. Incertain exemplary embodiments, some algorithms that are adapted toselect backup paths can use extra information that can be carried byrouting and signaling protocols.

As used herein, the term “Dijkstra's algorithm” means a method forfinding a lowest cost path from a first network node to a second networknode. The method comprises initializing a total path cost array and anodes checked array. The method comprises recursively visiting nodes andtracking costs for each possible path being traversed toward the secondnetwork node. Each path is extended based upon whether or not the pathpresently has the lowest cost as compared to other partial paths beingtraversed as candidates for the lowest cost path. As used herein, theterm “weight” means a value assigned to denote a relative desirabilityof use. Many path selection algorithms in current networks are based onDijkstra's algorithm, which can select a path of minimum weight amongall suitable paths. The assignment of link weights can control pathselection. In certain exemplary embodiments, weights used to computebackup paths can take into account shared restoration bandwidth.

In certain exemplary embodiments, link state information that can beflooded by a routing protocol can comprise:

Service Bandwidth: the bandwidth used by label switched paths on eachunidirectional link;

Reserved Bandwidth: the bandwidth that is not used on a unidirectionallink when the network is in a non-failure condition, but can be used toreroute traffic around the failure;

Available Bandwidth: the bandwidth that is not committed and thereforecan be allocated to service bandwidth and/or reserved bandwidth as newlabel switched path requests arrive;

Administrative Weight: a quantity that can be set by the networkoperator and can be used as a measure of a heuristic “cost” to thenetwork. A path with a smaller total weight is typically preferred overa path with a larger total weight.

Link state information can be communicated via extensions of OSPF/IS-ISfor MPLS. A label switched path can be selected as a shortest path basedon administrative weights. As used herein, the term “sufficient” meansadequate. In certain exemplary embodiments a bookkeeping system can keeptrack of bandwidth used and reserved on each unidirectional link in adistributed manner such that there is only necessary but sufficientbandwidth reserved on each link. Certain exemplary embodiments cancollect information to select optimized backup paths to minimize totalreserved restoration bandwidths over all network links. For each link,there can be a bandwidth reserved in both directions. Since each linkconnects two nodes, each node can be responsible for keeping trackbandwidth information of the outgoing direction of the link from thenode.

As used herein, the term “Failother” means an array name. In certainexemplary embodiments the Failother array can comprise values indicativeof bandwidths for rerouting traffic on a predetermined unidirectionallink if respective failures occur. For each link direction, aresponsible node can maintain a local array Failother[j], where j is anypossible failure point. Failother[j] can be the amount of bandwidth on alink direction to restore all failed label switched paths if failure joccurs. As used herein, the term “reserving” means an act of settingaside for future use.

Reserving a bandwidth equal to R=max {Failother[j]} where j can rangeover all predetermined possible failures can provide sufficient andnecessary bandwidth reserved to reroute traffic around any singlepredetermined failure. In certain exemplary embodiments, a bandwidth canbe selected that is less than the maximum value in the failother arrayif certain bandwidths exceed a predetermined threshold for which backuppaths can be provided. The bandwidth can be distributed to other networknodes using an extended routing protocol. When a backup path isselected, a signaling message carrying possible failure points thattraffic can be routed around (immediately downstream link andimmediately downstream node) on the label switched path can be sentalong the backup path. As used herein, the term “sending” meanstransmitting via a communication path. Sending the signaling message canallow responsible nodes along a backup path to automatically updatecorresponding Failother[j] entries for each link in a distributed way.As used herein, the term “deletion” means removal and/or erasure from amemory. During a lifecycle of a label switched path, possible operationscan comprise creation and deletion of the label switched path.

When a source node receives a label switched path request, the sourcenode can compute a label switched path using constrained shortest pathfirst algorithm (CSPF) with administrative weights and availablebandwidth of each unidirectional link. As used herein, the term “RSVP”means a standard designed signaling protocol to support linkreservations on networks of varying topologies and media. Through RSVP,a user's quality of service requests can be propagated to all nodesalong a data path, allowing the network to reconfigure itself to meet adesired level of service. Using RSVP Traffic Engineering (RSVP-TE)extensions can allow signaling messages to be explicitly routed from asource to a destination. Similar extensions can be defined forconstraint-based routing label distribution protocol (CR-LDP).

Label switched path creation can involve an initial signaling message(e.g., a PATH message) from a source node to a destination node withadmission control along the computed label switched path, then abandwidth reservation message (e.g., a RESV message) can be returnedfrom the destination node to the source node to finish establishment ofa label switched path. Upon receiving the RESV message, each node alongthe label switched path can select a backup path to the destination nodeby excluding the immediately downstream node and applying constrainedshortest path first algorithm.

Each respective node can send a signaling message along the selectedbackup path to establish the backup label switched path and reservesufficient shared restoration bandwidth. The signaling message caninclude the immediately downstream link and immediately downstream nodeinformation on the label switched path. The immediately downstream linkand immediately downstream node information can be used to maintainshared reservations at each unidirectional link along the backup path. Aresponsible node of unidirectional link along the backup path can updatethe Failother array as follows: Failother[j]←Failother[j]+b where jwhere j is the immediately downstream link and immediately downstreamnode on the label switched path and b is the requested bandwidth of thelabel switched path.

Implementing certain exemplary embodiments can involve a consistentassignment of network link identifiers and node identifiers by networknodes. Since link state routing can give each node a consistent view ofa network topology, each link can be indexed by hashing respective nodeidentifiers of two end points of a respective link in a standardizedway. Another possible solution can be for a network provider to providea globally unique link identifier for each link.

FIG. 3 is a block diagram of an exemplary embodiment of a network 3000that comprises five nodes and six links. A first label switched path of3100 to 3200 on link 3600 can consume one unit of bandwidth. Anassociated backup path to reroute traffic around a failure of link 3600can be 3100 to 3300 to 3400 to 3200. Now suppose node 3100 receives arequest for a second label switched path between 3100 and 3500 with abandwidth of one unit. At this time, node 3100 can have informationregarding the network topology with reservation information whereinbandwidth reserved on links 3650, 3700, and 3750 are each one unit andthe reserved bandwidth on other unidirectional links is all zero.

Node 3100 first can compute a label switched path, 3100 to 3300 to 3500along which a first message, such as a PATH message, can be sent. Whennode 3500 receives the first message, it sends out a responsive secondmessage, such as a RESV message, along the reverse path from node 3500to node 3100 to establish the label switched path. After node 3300receives the second message, node 3300 can compute a backup path adaptedto reroute traffic around link 3800 in event of a failure thereof. Thebackup path can be computed using the CSPF algorithm. The computedbackup path can be 3300 to 3400 to 3500. Node 3300 can send areservation message including information regarding downstream link3800, along 3300 to 3400 to 3500. The reservation message can compriseinformation adapted to establish the backup path 3300 to 3400 to 3500.Each responsible node of unidirectional links 3700 and 3850 along thebackup path can update respective Failother arrays correspondingly.

After node 3100 receives the second message, node 3100 can compute thebackup path adapted to reroute traffic around the downstream link 3650and downstream node 3300 if a failure of either or both occurs. Thebackup path can be computed using the CSPF algorithm, which can be 3100to 3200 to 3400 to 3500. Node 3100 can send a reservation message, along3100 to 3200 to 3400 to 3500 to establish the backup path. The messagecan comprise information regarding downstream link 3650 and downstreamnode 3300. Each responsible node of unidirectional links along thebackup path can update a respective Failother array correspondingly. Inthis embodiment, backup paths 3200 to 3400 to 3500 and 3100 to 3200 to3400 to 3500 can merge at node 3400. The backup scheme can comprise allmessages reaching the destination node of the label switched path toupdate the Failother array in a distributed manner.

After the label switched path and associated backup paths areestablished and local arrays are updated, each node can also updateavailable and reserved bandwidths for each unidirectional link. Changesfor affected unidirectional links can be disseminated to other nodes viaextended routing protocol OSPF or IS-IS. In the particular embodimentillustrated in FIG. 3, link status can comprise reserved bandwidths onthe links 3650 (from 3100 to 3300), 3700 (from 3300 to 3400), 3750 (from3400 to 3200), 3850 (from 3400 to 3500), 3600 (from 3100 to 3200), 3750(from 3200 to 3400), and 3850 (from 3400 to 3500) of one unit ofbandwidth. Similarly service bandwidths on links 3600, 3650, and 3800for this particular embodiment can be one unit. Absent other labelswitched paths, service bandwidths and reserved bandwidths on otherunidirectional links can be zero. Although both backup paths 3100 to3200 to 3400 to 3500 and 3300 to 3400 to 3500 for different labelswitched paths use common unidirectional link 3700, only one unit ofbandwidth typically will typically be reserved. This is because each ofthese two backup label switched paths can route traffic around twodifferent predetermined failure points.

When a source node receives a label switched path deletion request, thenetwork can delete the label switched path and its backup label switchedpaths, and release the reserved bandwidth for shared restoration.Because Failother arrays can be updated during LSP deletion, thedeletion process can update these arrays in a distributed manner. Usingthe RSVP protocol with traffic engineering, the source node can send onePATHTEAR message to a destination node of the label switched path alonga defined label switched path. Each node along the label switched pathcan also send a PATHTEAR message along its respective backup path.PATHTEAR messages along backup paths can comprise immediately downstreamlink and/or immediately downstream node information such that theresponsible nodes of each unidirectional link along the backup path canupdate the Failother array as follows: Failother[j]=Failother(k)[j]−bwhere j is the immediately downstream link and/or the immediatelydownstream node on the label switched path and b is the label switchedpath bandwidth. Updates to respective label switched path bandwidth andreserved path bandwidths can be handled similarly to label switched pathcreation.

FIG. 4 is a block diagram of an exemplary embodiment of a network 4000with six nodes and seven links. In certain exemplary embodiments, backuppaths can be computed for each node on a label switched path except fora destination node. Since restoration bandwidth can be shared acrossbackup paths, backup path selection can impact overall restorationbandwidths. Consider a label switched path using one unit of bandwidthfrom 4100 to 4500 and an associated backup path 4100 to 4400 to 4500.Node 4100 can receive another label switched path request for one unitbandwidth between node 4100 and node 4300. A label switched path can becomputed as 4100 to 4200 to 4300. Node 4100 can select a shortestdisjoint path 4100 to 4500 to 4600 to 4300 and node 4200 can select 4200to 4100 to 4500 to 4600 to 4300 as their backup paths respectively. Thetotal restoration bandwidth can be six units while 4100 can selectanother longer path 4100 to 4400 to 4500 to 4600 to 4300 as the backuppath, and 4200 can select 4200 to 4100 to 4400 to 4500 to 4600 to 4300as its backup path, the total restoration bandwidth can be five unitsonly assuming that paths 4100 to 4500 and 4100 to 4200 to 4300 arefailure disjoint.

A shortest path rerouting traffic around the immediately downstream nodemay not always lead to minimal bandwidth reservations for all backuppaths. An optimized selection of backup paths can minimize totalbandwidths reserved for backup paths. Certain exemplary embodiments canoptimize label switched path selection to reduce the total bandwidth,including both label switched paths and backup paths. A longer labelswitched path can result in larger total bandwidth reservations for alllabel switched paths since label switched paths cannot be shared. Alsolonger label switched paths can lead to longer service delay. Certainexemplary embodiments assume that the label switched path for each labelswitched path request can be the shortest path from source node todestination node.

As used herein, the term “selecting” means choosing. To achieve a betterbackup path selection, a node selecting a backup path can use some extrainformation. To distribute and collect extra information on each node,certain exemplary embodiments can use signaling extensions betweenneighboring nodes. Signaling messages can comprise TELL, ASK and REPLY.

For a TELL message, after a node selects or deletes its backup path, thenode can send the TELL message to the immediately downstream node withbackup path information. For the ASK message, before a node selects itsbackup path, it can send an ASK message to its immediately downstreamnode and asks for extra information. For the REPLY message, when a nodereceives the ASK message, the node can reply with the requestedinformation back to the node that sent the ASK message.

In certain exemplary embodiments, the ASK message information can beembedded in a PATH message during creation of the label switched pathwhile a TELL message information can be embedded in a RESV messageduring the label switched path creation. Upon the label switched pathdeletion, the TELL message for backup deletion can be embedded in aPATHTEAR message.

As used herein, the term “master node” means a predetermined node thatis responsible to maintain failure related information a particular linkand/or failure. In certain exemplary embodiments, for each possiblepredetermined failure, a master node can be defined which can beresponsible for maintaining failure related information. For apredetermined link failure, the master node can be the node terminatingthe link having a smaller node id while for a predetermined nodefailure; the master node can be the node itself. The master node of eachfailure along the label switched path can keep track of the bandwidththat has been reserved on other network unidirectional links to reroutetraffic around the predetermined failure. As used herein, the term“Failself” means an array name. In certain exemplary embodiments theFailself array can comprise values indicative of bandwidths onrespective unidirectional links to restore all affected label switchedpaths if a predetermined failure occurs. This information can bemaintained in a local array in the master node, called Failself, whereFailself[i] stores the bandwidth on unidirectional link i to restore allaffected label switched paths if the predetermined failure occurs. Justlike Failother arrays, a Failself array can be updated at each nodeduring label switched path creation and deletion.

When the immediately downstream node receives a TELL message aboutbackup label switched path creation, the immediately downstream node canupdate the Failself array for itself: Failself[i]=Failself[i]+b where iis a unidirectional link on the backup path and b is the bandwidth ofthe label switched path. If the immediately downstream node is also themaster node of the immediately downstream link, the Failself array forthe immediately downstream link can be updated in the same way. When theimmediately downstream node receives a TELL message, independent orembedded, regarding backup label switched path deletion, the immediatelydownstream node can update the Failself array for itself:Failself[i]=Failself[i]−b, where i has a range over the links on thebackup path and b is its bandwidth. Before a node selects a backup path,the node can send an ASK message to its immediately downstream node forFailself array information of the immediately downstream node and/or theimmediately downstream link. The REPLY message can provide a correctFailself array of the immediately downstream node and informationregarding the immediately downstream link if the node is the master nodeof the immediately downstream link. With Failself information, the nodecan be adapted to select a better backup path.

After a node along the label switched path collects the Failselfarray(s) from the immediately downstream node, the node can calculate anew array T[i]=max(Failself(DR)[i],Failself(DL)[i]) where DR means theimmediately downstream node and DL is the immediately downstream link,and i is any particular unidirectional link. As used herein, the term“maximum” means largest of a set. Then T[i] is the maximum bandwidthneeded on unidirectional link i if any one of the DR and DL failuresoccurs. This computation can be based on the network state before thenew backup label switched path is established. As used herein, the term“adjacent” means next to and/or nearby. After that, the node can assigna new weight to each unidirectional link in the network:

${w\lbrack i\rbrack} = \{ \begin{matrix}{{\min( {b,{{T\lbrack i\rbrack} + b - {R\lbrack i\rbrack}}} )} \cdot {W\lbrack i\rbrack}} & {{{{{if}\mspace{14mu}{T\lbrack i\rbrack}} + b - {R\lbrack i\rbrack}} > {0\mspace{14mu}{and}\mspace{14mu} i}} \notin \{ {DR} \}} \\ɛ & {{{if}\mspace{14mu}( {{{{T\lbrack i\rbrack} + b - {R\lbrack i\rbrack}} \leq {0\mspace{14mu}{or}\mspace{14mu} i}} \in \{ {DP} \}} )\mspace{14mu}{and}\mspace{14mu} i} \notin \{ {DR} \}} \\\infty & {{{if}\mspace{14mu} i} \in \{ {DR} \}}\end{matrix} $

where {DR} means the set of links adjacent to the immediately downstreamnode, which means the backup path should exclude this downstream router,and {DP} means the set of links downstream from the immediatelydownstream router along the label switched path. Then Dijkstra'salgorithm can be used to select the backup path from the node to thedestination node using these weights. In this formula, the assigned newweight of .epsilon. is in favor of the selection of particular links,which are downstream label switched path links for potential labelswitched path merging and links with enough existing restorationcapacity. In both cases, no extra restoration capacity need be reservedon those links

Certain operative embodiments can be used to evaluate systemperformances. For example, a particular operative model of a typical USintercity MPLS backbone network was tested that comprised 18-PoPs(Points-of-Presence) and 32 OC48-granularity links interconnected in adual backbone router (BR) architecture. Access routers (ARs) wereconnected to the same PoP into a virtual AR. Each PoP comprised threenodes: two BRs and one AR. The AR-to-AR demands in this study weregenerated using cumulative outgoing and incoming traffic from a demandforecast, i.e., all traffic starting and terminating at the ARrespectively. A random demand was selected according to source ARcumulative traffic outgoing probability and destination AR cumulativetraffic incoming probability. The bandwidth of each demand was uniformlygenerated from an interval of 10 to 100 Mbps. For simplicity, the MPLSbackbone link bandwidths was assumed to be deployed in units of OC48channels (approx. X=2.5 Gpbs). In the simulation, an online incrementaltraffic model was used, i.e. traffic demands arrived at the network oneby one, and never left. As used herein, the term “calculated” meanscomputed. In this particular operative embodiment, twenty random runswere generated and the average value for each data point calculated.

A frequently used metric for evaluating restoration path algorithms isrestoration overbuild, which is defined as a percentage of additionalresources for backup paths over that for label switched paths without anability to reroute traffic in event of a failure. Operative variablescan comprise α=ΣSC(i) and β=ΣTC(i), where i varies over all backbonelinks, where SC(i) is the required number of OC48 channels for serviceonly on link i, and TC(i) is the total required OC48 channels for bothservice and restoration on link i. The restoration overbuild can bedefined as ΛA=(β−α)/α.

Another commonly used metric is restoration bandwidth-mileage overbuild,or product overbuild, which is the ratio of total restorationbandwidth-mileage product to the total service bandwidth-mileageproduct. For variables defined as δ=Σ(SC(i)*L(i)) and φ=Σ(TC(i)*L(i)),where L(i) is the length in miles of link i. Then Π=(φ−δ)/δ can bedefined as the restoration bandwidth-mileage (product) overbuild.

Both Λ and Π metrics assume that each link has infinite bandwidth. Inreal networks, link bandwidth is limited. When a network is heavilyloaded, some label switched path demands can be blocked due toinsufficient bandwidth for either the label switched path or some backuppaths. The number of blocked demands is another metric used to measurethe network performance Unless otherwise stated, all the data shown wasbased on single link/node failure only and was averaged over 20different runs with different seeds.

For a first set of performance experiments, link capacities were set toinfinity and label switched path demands were assumed to arrive one at atime. In the operative embodiments tested, the label switched paths werealways routed along the shortest path. The backup paths were selectedusing immediately downstream node disjoint shortest paths to thedestination node in the baseline scheme and enhancement I, while thebackup paths in enhancement II are selected using modified link weightsettings. The baseline scheme used only a merging technique forbandwidth sharing. Both enhancement I and enhancement II schemes usedoperative embodiments of distributed bandwidth management methods.Enhancement I selected disjoint shortest paths while enhancement IIselected disjoint optimized shortest paths. The baseline test onlyshared bandwidth between a particular label switched path and the backuppaths associated with the particular label switched path. Theillustrated enhancement schemes are able to share bandwidth among anylabel switched paths and backup label switched paths. After all labelswitched paths were routed on the network, the restoration overbuild andrestoration product overbuild was calculated for each of the schemes.

FIG. 5 is a performance graph 5000 relating to an operative embodimentthat illustrates the average restoration overbuild for each of the threeschemes tested. Each algorithm is compared with the same traffic demandsranging from 500 to 16000 label switched paths. The baseline schemeresults are shown as line 5100. The results from the scheme denoted asenhancement I are shown as line 5200. The results from the schemedenoted as enhancement II are shown as line 5300. Both enhancements usedsignificantly fewer restoration overbuilds than the baseline scheme andenhancement II used the least resources.

Enhancement I performed more than 100% better than the baseline schemein restoration overbuild and enhancement II used about half of theoverbuild of enhancement I. Enhancements operated on each node in adistributed manner with no centralized server. Enhancement I wasimplemented using Failother arrays. The enhancement II was implementedusing both Failother and Failself arrays.

FIG. 6 is a performance graph 6000 relating to an operative embodimentthat depicts the restoration bandwidth-mileage product overbuild. Thebaseline scheme results are shown as line 6100. The results from thescheme denoted as enhancement I are shown as line 6200. The results fromthe scheme denoted as enhancement II are shown as line 6300. Again,enhancement I reduced overbuild by about 100% compared with the baselinescheme and enhancement II further reduced product overbuild byapproximately 50% as compared with enhancement I.

A second set of performance experiments using of operative embodimentsstudied behaviors of baseline scheme and the two enhancements. Resultswere measured with respect to the number of blocked demands due to anoverloaded network. In these simulation experiments, each link capacitywas set to four OC48 channels (total 10 Gbps). Label switched pathdemands were chosen as described before. As demands were routed, and anaccounting was kept of how much service bandwidth was used per link, aswell as how much restoration bandwidth was reserved on each link foreach failure. If there was insufficient available capacity for eitherthe label switched path or one of the backup paths of an incoming labelswitched path request, then the request was recorded as blocked. Thelabel switched path was chosen as the shortest path along links withavailable bandwidth by using a constrained shortest path first (CSPF)algorithm. Ten simulation runs were performed with different randomnumber generator seeds.

FIG. 7 is a performance graph 7000 relating to an operative embodimentthat shows the number of demands blocked after 1200 demands were loadedonto the network for each of the different fast reroute schemes. Thebaseline scheme results are shown as line 7100. The results from thescheme denoted as enhancement I are shown as line 7200. The results fromthe scheme denoted as enhancement II are shown as line 7300. Bothenhancements significantly outperformed the baseline scheme. EnhancementII performed the best in the operative embodiment utilized. Relativeperformance improvements demonstrated by both enhancement schemes heldas experiments were conducted with different demand sets.

Thus, certain exemplary embodiments provide a method comprising: in anetwork at a node located on a label switched path: selecting anoptimized backup path to respond to a failure; and for each link alongthe backup path, reserving a backup bandwidth, wherein the backupbandwidth is sufficient to reroute traffic around the failure. As usedherein, the term “respond” means to reply to a query.

FIG. 8 is a flow diagram of an exemplary embodiment of a method 8000 forprovisioning and/or preparing a network for rerouting traffic around afailure. As used herein, the term “link-coupled” means communicativelycoupled via a link. A network can comprise a plurality of link-couplednodes. As used herein, the term “non-terminal node” means a node on anetwork label switched path that is not an ultimate source or ultimaterecipient of a message outside of the network.

In certain exemplary embodiments, backup paths can be calculated at eachnon-terminal node located on a label switched path. A total of n−1backup paths can be determined for a label switched path having n nodes.Each non-terminal node can calculate a backup path to reroute networktraffic in the event of a predetermined failure of a respective node(other than the destination node) and/or link immediately downstream ofthe non-terminal node on the label switched path. The label switchedpath can be one of a plurality of label switched paths in the network.Each label switched path can comprise a sub-plurality of network nodes.That is, the nodes comprising the label switched path can be less thanall the nodes of the network. The network can be an IP network, amultiple protocol label switching (MPLS) network, a generalized multipleprotocol label switching (GMPLS) network, and/or the Internet, etc. Incertain exemplary embodiments, method 8000 can be implemented utilizinga centralized server. Method 8000 can be implemented for link failure,node failure, and/or shared risk link failure since the optimized backuppath can be link, node, and shared risk link disjoint from the labelswitched path.

At activity 8100, a request for a label switched path can be receivedfrom a user of an information device communicatively coupled to a sourcenode. As used herein, the term “communicatively coupled” means linked ina manner that facilitates communications. The request for the labelswitched path can comprise information related to service such as aquality of service, cost of service, and/or requested bandwidth, etc.

At activity 8150, the label switched path can be determined. Indetermining the label switched path, link weights can be determined,sent, and/or received. Link weights can be established initially by aspecification of a network administrator, a network policy, and/ordynamic responses to broadcast queries by network nodes, etc. In certainexemplary embodiments, link weights can be provided to a particular nodein the network. The link weights can be broadcast across the network toother nodes from the particular node, such as via OSPF and/or IS-ISrouting protocol, etc. The source node can select the label switchedpath via any algorithm using the link weight such as Dijkstra'salgorithm.

At activity 8200, the source node can send a label switched pathcreation signal (such as, e.g., a PATH message in RSVP-TE) to thedestination along the selected label switched path. Responsive to thecreation signal, a return signal (such as, e.g., an RESV message) can besent from the destination node to the source node of the label switchedpath to confirm creation of the label switched path.

At and after activity 8250, any node along the label switched path,except the destination node, can perform a plurality of activitiessequentially, partially in parallel, and/or substantially in parallelwith respect to other nodes and/or other activities. For illustrativepurposes, certain exemplary embodiments can be conceptualized byconsidering an iterative process beginning with the source node of thelabel switched path assigned to be node X in method 8000.

At activity 8300, the node X can send a message, such as an ASK message,to the immediately downstream node. In response, the immediatelydownstream node can return to node X a message, such as a REPLY message,that contains failure related information regarding an immediatelydownstream node failure and/or an immediately downstream link failure ifthe immediately downstream node is the master node of the immediatelydownstream link.

At activity 8350, node X can reset link weights used in exemplaryembodiments to determine an optimized backup path for the label switchedpath. Information used in resetting link weights can be received and/orcollected from node X's immediately downstream nodes. In certainexemplary embodiments, link weights can be determined according to aformula:

${w\lbrack i\rbrack} = \{ \begin{matrix}{{\min( {b,{{T\lbrack i\rbrack} + b - {R\lbrack i\rbrack}}} )} \cdot {W\lbrack i\rbrack}} & {{{{{if}\mspace{14mu}{T\lbrack i\rbrack}} + b - {R\lbrack i\rbrack}} > {0\mspace{14mu}{and}\mspace{14mu} i}} \notin \{ {DR} \}} \\ɛ & {{{if}\mspace{14mu}( {{{{T\lbrack i\rbrack} + b - {R\lbrack i\rbrack}} \leq {0\mspace{14mu}{or}\mspace{14mu} i}} \in \{ {DP} \}} )\mspace{14mu}{and}\mspace{14mu} i} \notin \{ {DR} \}} \\\infty & {{{if}\mspace{14mu} i} \in \{ {DR} \}}\end{matrix} $

where:

T[i]=max(Failself(DR)[i], Failself(DL)[i]);

Failself(DR)[i] a necessary bandwidth on link i to reroute trafficassociated with all label switched paths affected by the failure of DR;

Failself(DL)[i] a necessary bandwidth on link i to reroute trafficassociated with all label switched paths affected by the failure of DL;

DR is the immediately downstream node of the non-terminal node along thelabel switched path;

DL is a link between the non-terminal node and node DR;

{DR} is a set of links adjacent to node DR;

{DP} is a set of links between the non-terminal node and the destinationnode of the label switched path;

R[i] is a bandwidth reserved for link i to reroute traffic responsive toa single failure in the network;

b is the requested bandwidth of the label switched path;

W[i] is a prior weight for link i;

ε is a small, non-zero weight in favor of selection of link i; and

w[i] is a modified weight associated with a link i

At activity 8400, node X can determine the optimized backup path of thelabel switched path to reroute traffic around the immediately downstreamlink and/or immediately downstream node from node X in event of afailure. The algorithm used for the backup path can be any pathoptimizing algorithm and/or shortest path algorithm, such as Dijkstra'salgorithm, utilizing the new resetting link weights from activity 8350.

At activity 8450, node X can send a bandwidth reservation signal alongthe selected optimized backup path. As used herein, the term “bandwidthreservation signal” means a message requesting that transmissioncapacity on a link be set aside for a predetermined purpose. Thebandwidth reservation signal can comprise information regarding theimmediately downstream link and/or the immediately downstream node ofnode X.

At activity 8500, each node along the optimized backup path can use theoptimized backup path to update respective bandwidth related values,such as Failother arrays, for each node responsible for bandwidthreservation on a respective unidirectional link of the optimized backuppath. For example, using a Failother array: Failother[i]=Failother[i]+b,where i is the predetermined failure carried in the reservation messageand b is the bandwidth of the label switched path. As used herein, theterm “previously stored” means resident in a memory at a prior time. Incertain exemplary embodiments, reserving a backup bandwidth can comprisechanging a value, responsive to a message requesting creation of thebackup path, by adding a bandwidth associated with the optimized backuppath to a previously stored value of a bandwidth associated with thepredetermined failure.

At activity 8550, each node along the backup path can reserve backupbandwidth on respective links, the reserved backup bandwidth sufficientand necessary to reroute traffic around any predetermined failure. Thereserved backup bandwidth can be determined by: R=max(Failother[i])where i can have a range over all possible predetermined failures. Asused herein, the term “confirmation” means a verifying acknowledgment.

In certain exemplary embodiments, the nodes along the backup path cansend a confirmation message regarding backup path creation and/orbandwidth reservation. In certain exemplary embodiments, the network canbe flooded with information indicative of the reserved backup bandwidthfor each unidirectional link.

At activity 8600, if node X is a master node of an immediatelydownstream link, node X can update stored information regardingbandwidths reserved in event of a failure of the immediately downstreamlink, e.g., update a Failself array as: Failself[i]=Failself[i]+b, wherei can have a range over all unidirectional links along the optimizedbackup path and b is the label switched path bandwidth.

At activity 8650, node X can send a message to a node immediatelydownstream of the non-terminal node X on the label switched path thatcomprises information regarding the optimized backup path.

At activity 8700, after the downstream node of node X receives themessage comprising the optimized backup path information, if thedownstream node is the master node of the immediately downstream link ofnode X, this node can update values related to a possible failure ofnode X's immediately downstream link, e.g., a Failself array,Failself[i]=Failself[i]+b, where i can range over all unidirectionallinks along the optimized backup path and b is the label switched pathbandwidth. If node X is not the destination node of the label switchedpath, node X can update the stored failure related information values,e.g., for the Failself array.

At activity 8750, a new node X can be incrementally considered. Forexample, node X can be incremented to be a node further along the labelswitched path from a prior node X. Activities 8300 through 8750 can berepeated iteratively until the destination node of the label switchedpath is reached. The iterative procedure of method 8000 is forillustrative purposes only.

FIG. 9 is a flow diagram of an exemplary embodiment of a method 9000 forupdating a network for deletion of a label switched path, wherein thenetwork is adapted to reroute traffic around a failure should thefailure occur. At activity 9100, a source node on the label switchedpath can receive a request to delete the label switched path.

At activity 9150, the source node can send a deletion message tonon-terminal nodes on the label switched path. The deletion message canbe in the form of a label switched path deletion signaling message (suchas, e.g., a PATHTEAR message).

At and/or after activity 9200, any node along the label switched path,except the destination node, can perform a plurality of activitiessequentially, partially in parallel, and/or substantially in parallelwith respect to other nodes and/or other activities. For illustrativepurposes, certain exemplary embodiments can be conceptualized byconsidering an iterative process beginning with the source node of thelabel switched path as node X in method 9000.

At activity 9250, node X removes any information stored related to thedeleting label switched path.

At activity 9300, node X can send a deletion message along the optimizedbackup path associated with the label switched path. The deletionmessage can comprise information regarding the immediately downstreamlink and/or the immediately downstream node from node X on the labelswitched path.

At activity 9350, each node along the optimized backup path can deletethe optimized backup path from memory and update respective bandwidthvalues, such as Failother arrays, for each node responsible forbandwidth reservation on a respective unidirectional link of theoptimized backup path. For example, by determining:Failother[i]=Failother[i]−b, where i is the predetermined failurecarried in the reservation message and b is the bandwidth of the labelswitched path.

At activity 9400, each node along the backup path can modify reservedbackup bandwidths on respective links such that bandwidth is sufficientand necessary to reroute traffic around any predetermined failure. Forexample, the reserved backup bandwidth can be determined by:R=max(Failother[i]) where i can have a range over all possiblepredetermined failures. In certain exemplary embodiments, the nodesalong the backup path can send a confirmation message regarding backuppath deletion and/or bandwidth reservation. In certain exemplaryembodiments, the network can be flooded with information indicative ofeach reserved backup bandwidth for each predetermined link.

At activity 9450, if node X is a master node of an immediatelydownstream link, node X can update stored information regardingbandwidths reserved in event of a failure of the immediately downstreamlink, e.g., update a Failself array as: Failself[i]=Failself[i]−b, wherei can have a range over all unidirectional links along the optimizedbackup path and b is the label switched path bandwidth.

At activity 9500, node X can send a deletion message to a nodeimmediately downstream of the non-terminal node X on the label switchedpath that comprises information regarding the optimized backup path andthe deletion thereof.

At activity 9550, after the downstream node of node X receives thedeletion message comprising the optimized backup path information, ifthe downstream node is the master node of the immediately downstreamlink of node X, this node can update values related to a possiblefailure of node X's immediately downstream link, e.g., a Failself array,Failself[i]=Failself[i]−b, where i can range over all unidirectionallinks along the optimized backup path and b is the label switched pathbandwidth. If node X is not the destination node of the label switchedpath, node X can update stored failure related information values, e.g.,the Failself array.

At activity 9600, a new node X can be incrementally considered. Forexample, node X can be incremented to be a node further along the labelswitched path from a prior node X. Activities 9300 through 9550 can berepeated iteratively until the destination node of the label switchedpath is reached. The iterative procedure of method 9000 is forillustrative purposes only.

FIG. 10 is a flow diagram of an exemplary embodiment of a method 10000for responding to a network failure

At activity 10100, a failure in the network can be detected. As usedherein, the term “detecting” means an act of sensing or perceiving. Thefailure can interrupt service to one or more label switched paths.

At activity 10200, impacted label switched paths can be determined. Asused herein, the term “impacted” means affected or subjected to animpact.

At activity 10200, network traffic can be rerouted around the failure onan optimized backup path. The optimized backup path can be associatedwith a label switched path impacted and/or affected by the failure.

FIG. 11 is a block diagram of an exemplary embodiment of an informationdevice 11000, which in certain operative embodiments can comprise, forexample, a device comprised in nodes 1100, 1200, 1300, 1400, 1500, 1600,1700, 1800, and 1900 of FIG. 1. As used herein, the term“machine-readable medium” means a memory readable by an informationdevice. Information device 11000 can comprise any of numerous well-knowncomponents, such as for example, one or more network interfaces 11100,one or more processors 11200, one or more memories 11300 containinginstructions 11400, one or more input/output (I/O) devices 11500, and/orone or more user interfaces 11600 coupled to I/O device 11500, etc.

In certain exemplary embodiments, via one or more user interfaces 11600,such as a graphical user interface, a user can input information relatedto label switched paths on network nodes or network policies.

Thus, certain exemplary embodiments provide a method comprising: in anetwork at a located on a label switched path: selecting a backup pathto respond to a failure; and for each link along the backup path,reserving a backup bandwidth, wherein the backup bandwidth is sufficientto reroute traffic around the failure.

Still other embodiments will become readily apparent to those skilled inthis art from reading the above-recited detailed description anddrawings of certain exemplary embodiments. It should be understood thatnumerous variations, modifications, and additional embodiments arepossible, and accordingly, all such variations, modifications, andembodiments are to be regarded as being within the spirit and scope ofthe appended claims. For example, regardless of the content of anyportion (e.g., title, field, background, summary, abstract, drawingfigure, etc.) of this application, unless clearly specified to thecontrary, there is no requirement for the inclusion in any claim of theapplication of any particular described or illustrated activity orelement, any particular sequence of such activities, or any particularinterrelationship of such elements. Moreover, any activity can berepeated, any activity can be performed by multiple entities, and/or anyelement can be duplicated. Further, any activity or element can beexcluded, the sequence of activities can vary, and/or theinterrelationship of elements can vary. Accordingly, the descriptionsand drawings are to be regarded as illustrative in nature, and not asrestrictive. Moreover, when any number or range is described herein,unless clearly stated otherwise, that number or range is approximate.When any range is described herein, unless clearly stated otherwise,that range includes all values therein and all sub-ranges therein. Anyinformation in any material (e.g., a United States patent, United Statespatent application, book, article, etc.) that has been incorporated byreference herein, is only incorporated by reference to the extent thatno conflict exists between such information and the other statements anddrawings set forth herein. In the event of such conflict, including aconflict that would render a claim invalid, then any such conflictinginformation in such incorporated by reference material is specificallynot incorporated by reference herein.

What is claimed is:
 1. A system communicatively linked to a networkcomprising a plurality of link-coupled nodes at a non-terminal nodelocated on a label switched path of a plurality of label switched pathsin the network, the system comprising: a memory that storesinstructions; a processor that executes the instructions to performoperations comprising: selecting an optimized backup path for reroutingtraffic around a failure located downstream of the non-terminal node,wherein the failure is one of a plurality of possible failures on theplurality of label switched paths; reserving a backup bandwidth for eachpredetermined link of a plurality of predetermined links along theoptimized backup path, wherein the backup bandwidth is determined by avalue corresponding to a bandwidth associated with a particular failureof the plurality of possible failures; updating the value of the backupbandwidth; and adjusting a bandwidth associated with the optimizedbackup path to a previously stored value of a bandwidth associated witha link on the optimized backup path.
 2. The system of claim 1, whereinthe operations further comprise deleting the optimized backup path froma memory for each respective node.
 3. The system of claim 2, wherein theoperations further comprise transmitting a deletion signal along theoptimized backup path, wherein the deletion signal deletes the optimizedbackup path from the memory for each respective node.
 4. The system ofclaim 3, wherein the operations further comprise receiving aconfirmation message indicating that the optimized backup path has beendeleted.
 5. The system of claim 1, wherein the operations furthercomprise decreasing the bandwidth associated with the optimized backuppath to the previously stored value of the bandwidth.
 6. The system ofclaim 1, wherein the operations further comprise determining theoptimized backup path by resetting link weights for each predeterminedlink.
 7. The system of claim 1, wherein the operations further comprisereceiving a request for the label switched path, wherein the requestcomprises information related to a requested bandwidth.
 8. The system ofclaim 1, wherein the operations further comprise receiving a messagefrom a node immediately downstream of the non-terminal node on the labelswitched path that includes failure information for the failure.
 9. Thesystem of claim 1, wherein the operations further comprise reserving thebackup bandwidth by adding the bandwidth associated with the optimizedbackup path to a previously stored value of a bandwidth associated withthe failure.
 10. The system of claim 1, wherein the operations furthercomprise rerouting traffic associated with a label switched pathaffected by the failure based on the optimized backup path.
 11. Thesystem of claim 1, wherein the operations further comprise transmittinga message associated with the optimized backup path to a nodeimmediately downstream of the non-terminal node on the label switchedpath.
 12. The system of claim 1, wherein the operations further comprisereceiving a message from each respective node indicating backup pathcreation and bandwidth reservation.
 13. The system of claim 1, whereinthe backup bandwidth is reserved for each predetermined link of theplurality of predetermined links along the optimized backup path basedon a signal including information regarding a node immediatelydownstream of the non-terminal node on the label switched path.
 14. Thesystem of claim 1, wherein the backup bandwidth is sufficient to reroutethe traffic around a first single failure on one of the plurality oflabel switched paths.
 15. A method for use in a network comprising aplurality of link-coupled nodes at a non-terminal node located on alabel switched path of a plurality of label switched paths in thenetwork, the method comprising: selecting an optimized backup path forrerouting traffic around a failure located immediately downstream of thenon-terminal node; reserving a backup bandwidth for each predeterminedlink of a plurality of predetermined links along the optimized backuppath, wherein the backup bandwidth is determined by a valuecorresponding to a bandwidth associated with a particular failure of aplurality of possible failures; updating the value of the backupbandwidth; and adjusting, by utilizing instructions from memory that areexecuted by a processor, a bandwidth associated with the optimizedbackup path to a previously stored value of a bandwidth associated witha link on the optimized backup path.
 16. The method of claim 15, furthercomprising deleting the optimized backup path from a memory for eachrespective node.
 17. The method of claim 15, further comprisingreceiving a confirmation message from each respective node indicatingthat the optimized backup path has been deleted.
 18. The method of claim15, further comprising receiving a request for the label switched path,wherein the request comprises information related to a cost of service.19. The method of claim 15, further comprising rerouting trafficassociated with a label switched path affected by the failure byutilizing the optimized backup path.
 20. A machine-readable devicecoupled to a network comprising a plurality of link-coupled nodes at anon-terminal node located on a label switched path of a plurality oflabel switched paths in the network, the machine readable devicecomprising instructions, which when loaded and executed by a processor,cause the processor to perform operations comprising: selecting anoptimized backup path for rerouting traffic around a failure locatedimmediately downstream of the non-terminal node; reserving a backupbandwidth for each predetermined link of a plurality of predeterminedlinks along the optimized backup, wherein the backup bandwidth isdetermined by a value corresponding to a bandwidth associated with aparticular failure of a plurality of possible failures; updating thevalue of the backup bandwidth; and adjusting a bandwidth associated withthe optimized backup path to a previously stored value of a bandwidthassociated with a link on the optimized backup path.